Performance of Critical Path Type Algorithms with Communication Delay
نویسنده
چکیده
The Brucker-Garey-Johnson algorithm and Hu’s algorithm are based on the idea of the critical path method and were developed for the model with unit execution time tasks, precedence constraints and parallel identical processors. The performance guarantees for these algorithms have been presented in Singh and Zinder (2000a, 2000b). We present upper bounds for the Brucker-Garey-Johnson algorithm with communication delays, which can be seen as a generalization of the performance guarantees in Singh and Zinder (2000a, 2000b). As a particular case this also gives performance guarantees for Hu’s algorithm with communication delays and therefore, also generalizes the previously known performance guarantees for this algorithm. KeywordsScheduling theory, Unit execution and communication times, Precedence, Maximum lateness, Worst-case analysis ∗ Corresponding author’s email: [email protected] International Journal of Operations Research
منابع مشابه
An Efficient LUT Design on FPGA for Memory-Based Multiplication
An efficient Lookup Table (LUT) design for memory-based multiplier is proposed. This multiplier can be preferred in DSP computation where one of the inputs, which is filter coefficient to the multiplier, is fixed. In this design, all possible product terms of input multiplicand with the fixed coefficient are stored directly in memory. In contrast to an earlier proposition Odd Multiple Storage ...
متن کاملDesign and Practical Implementation of a New Markov Model Predictive Controller for Variable Communication Packet Loss in Network Control Systems
The current paper investigates the influence of packet losses in network control systems (NCS’s) using the model predictive control (MPC) strategy. The study focuses on two main network packet losses due to sensor to controller and controller to actuator along the communication paths. A new Markov-based method is employed to recursively estimate the probability of time delay in controller to ac...
متن کاملEvaluating Multipath TCP Resilience against Link Failures
Standard TCP is the de facto reliable transfer protocol for the Internet. It is designed to establish a reliable connection using only a single network interface. However, standard TCP with single interfacing performs poorly due to intermittent node connectivity. This requires the re-establishment of connections as the IP addresses change. Multi-path TCP (MPTCP) has emerged to utilize multiple ...
متن کاملCongestion Control Approaches Applied to Wireless Sensor Networks: A Survey
Wireless Sensor Networks (WSNs) are a specific category of wireless ad-hoc networks where their performance is highly affected by application, life time, storage capacity, processing power, topology changes, the communication medium and bandwidth. These limitations necessitate an effective data transport control in WSNs considering quality of service, energy efficiency, and congestion control. ...
متن کاملA High-Speed Dual-Bit Parallel Adder based on Carbon Nanotube FET technology for use in arithmetic units
In this paper, a Dual-Bit Parallel Adder (DBPA) based on minority function using Carbon-Nanotube Field-Effect Transistor (CNFET) is proposed. The possibility of having several threshold voltage (Vt) levels by CNFETs leading to wide use of them in designing of digital circuits. The main goal of designing proposed DBPA is to reduce critical path delay in adder circuits. The proposed design positi...
متن کامل